Graph traversal

Results: 141



#Item
31The VLDB Journal DOIs00778REGULAR PAPER  Trie-join: a trie-based method for efficient string similarity joins

The VLDB Journal DOIs00778REGULAR PAPER Trie-join: a trie-based method for efficient string similarity joins

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2014-11-20 04:14:00
32On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs Michael A. Bender Jeremy T. Fineman

On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs Michael A. Bender Jeremy T. Fineman

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2007-09-28 06:21:25
33CCCG 2010, Winnipeg MB, August 9–11, 2010  I/O Efficient Path Traversal in Well-Shaped Tetrahedral Meshes Craig Dillabaugh  Abstract

CCCG 2010, Winnipeg MB, August 9–11, 2010 I/O Efficient Path Traversal in Well-Shaped Tetrahedral Meshes Craig Dillabaugh Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:17
342368  IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. 10, OCTOBER 2014 Bp -Tree: A Predictive B+-Tree for Reducing Writes on Phase Change Memory

2368 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. 10, OCTOBER 2014 Bp -Tree: A Predictive B+-Tree for Reducing Writes on Phase Change Memory

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2014-09-19 00:42:19
35Incremental Mining of Frequent Query Patterns from XML Queries for Caching Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zhang, Lizhu Zhou Department of Computer Science and Technology, Tsinghua University, Beijing 1000

Incremental Mining of Frequent Query Patterns from XML Queries for Caching Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zhang, Lizhu Zhou Department of Computer Science and Technology, Tsinghua University, Beijing 1000

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-01-09 09:42:51
36Cache Craftiness for Fast Multicore Key-Value Storage Yandong Mao, Eddie Kohler† , Robert Morris MIT CSAIL, † Harvard University Abstract We present Masstree, a fast key-value database designed for

Cache Craftiness for Fast Multicore Key-Value Storage Yandong Mao, Eddie Kohler† , Robert Morris MIT CSAIL, † Harvard University Abstract We present Masstree, a fast key-value database designed for

Add to Reading List

Source URL: pdos.csail.mit.edu

Language: English - Date: 2015-04-29 10:31:18
37CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:00:20
38CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003  Multidimensional Orthogonal Range Search Using Tries Lingke Bu  ∗

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Multidimensional Orthogonal Range Search Using Tries Lingke Bu ∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:32
39

PDF Document

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-09-26 07:53:23
40CS109A Notes for LectureBinary Trees Every binary tree has two \slots

CS109A Notes for LectureBinary Trees Every binary tree has two \slots" for children; it may have none, either one, or both.  Empty (0-node) binary tree is possible.

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:10